ILUS: An Incomplete LU Preconditioner in Sparse Skyline Format
نویسندگان
چکیده
Incomplete LU factorizations are among the most eeective preconditioners for solving general large, sparse linear systems arising from practical engineering problems. This paper shows how an ILU factorization may be easily computed in sparse skyline storage format, as opposed to traditional row-by-row schemes. This organization of the factorization has many advantages, including its amenability when the original matrix is in skyline format, the ability to dynamically monitor the stability of the factorization, and the fact that factorizations may be produced with symmetric structure. Numerical results are presented for Galerkin Finite Element matrices arising from the standard square lid-driven cavity problem.
منابع مشابه
On the Impact of Inverse-Based dropping on ILUs derived from direct methods
In this paper we present a new incomplete LU decomposition which is based on an existing sparse direct solver. In contrast to many incomplete LU decompositions this ILU incorporates information about the inverse factors L−1 and U−1 which have direct influence on the dropping strategy. We demonstrate in several large scale examples that this implementation constructs a robust preconditioner.
متن کاملMultilevel Preconditioners Constructed From Inverse-Based ILUs
This paper analyzes dropping strategies in a multilevel incomplete LU decomposition context and presents a few of strategies for obtaining related ILUs with enhanced robustness. The analysis shows that the Incomplete LU factorization resulting from dropping small entries in Gaussian elimination produces a good preconditioner when the inverses of these factors have norms that are not too large. ...
متن کاملComputing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
Standard preconditioning techniques based on incomplete LU (ILU) factorizations offer a limited degree of parallelism, in general. A few of the alternatives advocated so far consist of either using some form of polynomial preconditioning, or applying the usual ILU factorization to a matrix obtained from a multicolor ordering. In this paper we present an incomplete factorization technique based ...
متن کاملMIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least-Squares Problems
This paper describes a Multilevel Incomplete QR (MIQR) factorization for solving large sparse least-squares problems. The algorithm builds the factorization by exploiting structural orthogonality in general sparse matrices. At any given step, the algorithm finds an independent set of columns, i.e., a set of columns that have orthogonal patterns. The other columns are then block orthogonalized a...
متن کامل